Scattering theory and discrete-time quantum walks
نویسندگان
چکیده
منابع مشابه
Scattering theory and discrete-time quantum walks
We study quantum walks on general graphs from the point of view of scattering theory. For a general finite graph we choose two vertices and attach one half line to each, and consider walks that proceed from one half line, through the graph, to the other. The probability of starting on one line and reaching the other after n steps can be expressed in terms of the transmission amplitude for the g...
متن کاملScattering theory and quantum walks
We study quantum walks on general graphs from the point of view of scattering theory. For a general finite graph we choose two vertices and attach one half line to each. We are interested in walks that proceed from one half line, through the graph, to the other. The particle propagates freely on the half lines but is scattered at each vertex in the original graph. The probability of starting on...
متن کاملDiscrete-Time Quantum Walks and Graph Structures
We formulate three current models of discrete-time quantum walks in a combinatorial way. These walks are shown to be closely related to rotation systems and 1-factorizations of graphs. For two of the models, we compute the traces and total entropies of the average mixing matrices for some cubic graphs. The trace captures how likely a quantum walk is to revisit the state it started with, and the...
متن کاملModifying quantum walks: A scattering theory approach
We show how to construct discrete-time quantum walks on directed, Eulerian graphs. These graphs have tails on which the particle making the walk propagates freely, and this makes it possible to analyze the walks in terms of scattering theory. The probability of entering a graph from one tail and leaving from another can be found from the scattering matrix of the graph. We show how the scatterin...
متن کاملQuantum walks on graphs and quantum scattering theory
A number of classical algorithms are based on random walks on graphs. It is hoped that recently defined quantum walks can serve as the basis for quantum algorithms that will faster than the corresponding classical ones. We discuss a particular kind of quantum walk on a general graph. We affix two semi-infinite lines to a general finite graph, which we call tails. On the tails, the particle maki...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physics Letters A
سال: 2004
ISSN: 0375-9601
DOI: 10.1016/j.physleta.2004.03.005